<HTML><HEAD><TITLE>strong_components(+Graph, -StrongComponents)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>strong_components(+Graph, -StrongComponents)</H1>
Computes the strongly connected components of a graph
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>StrongComponents</EM></DT>
<DD>list of lists of integer node numbers
</DD>
</DL>
<H2>Description</H2>
<P>
    Computes the strongly connected components, i.e. maximal subsets
    of the graph's nodes in which all nodes are mutually accessible.
    The implementation essentially uses Tarjan's algorithm with a
    complexity of O(Nnodes + Nedges).
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>strong_components(+, -) is det
</UL>
<H2>See Also</H2>

</BODY></HTML>
